Computing observability don't cares efficiently through polarization
نویسندگان
چکیده
منابع مشابه
Computing observability don't cares efficiently through polarization
A new method is presented to compute the exact observability don’t cares (ODC’s) for multiple-level combinational circuits. A new mathematical concept, called polarization, is introduced. Polarization captures the essence of ODC calculation on the otherwise difficult points of reconvergence. It makes it possible to derive the ODC of a node from the ODC’s of its fanouts with a very simple formul...
متن کاملComputing Observability Don't Cares Eeciently through Polarization
| A new method is presented to compute the exact observability don't cares (ODCs) for multiple-level com-binational circuits. A new mathematical concept, called polarization , is introduced. Polarization captures the essence of ODC calculation on the otherwise diicult points of recon-vergence. It makes it possible to derive the ODC of a node from the ODCs of its fanouts with a very simple formu...
متن کاملLow Power Syntlhesis via Transparent Latches and Observability Don’t Cares
Transparent Latches We describe a synthesis technique for power optimization in combinational logic circuits. We remove unnecessary signal transitions in circuits b y addin transparent latches. Observability don’t-care sets ( b D C s ) are used to find such transitions, places where latches are inserted, and conditions f o r disabling the latches. W e propose an algorithm for adding transparent...
متن کاملImproved SAT-based Reachability Analysis with Observability Don't Cares
The dramatic performance improvements of SAT solvers over the past decade have increased their deployment in hardware verification applications. Many problems that were previously too large and complex for SAT techniques can now be handled in an efficient manner. One such problem is reachability analysis, whose instances are found throughout verification applications such as unbounded model che...
متن کاملComputing Congruences Efficiently
For a fixed similarity type which is at least binary, we show there is a linear time algorithm for computing the principal congruence generated by a pair of elements. Let A be a finite algebra and let θ be a partition of A. In this note we give a simple algorithm for computing the smallest congruence containing θ and discuss its efficiency. We begin with the case that θ only contains one nontri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1998
ISSN: 0278-0070
DOI: 10.1109/43.709395